Using network alignment to identify conserved consumer behaviour modelling constructs

- Mathieson, Luke, De Vries, Natalie Jane, Moscato, Pablo

Graph editing problems with extended regularity constraints

- Mathieson, Luke

Separating sets of strings by finding matching patterns is almost always hard

- Lancia, Giuseppe, Mathieson, Luke, Moscato, Pablo

Editing graphs to satisfy degree constraints: a parameterized approach

- Mathieson, Luke, Szeider, Stefan

Upper and lower bounds for finding connected motifs in vertex-colored graphs

- Fellows, Michael R., Fertin, Guillaume, Hermelin, Danny, Vialette, Stephane

Milling a graph with turn costs: a parameterized complexity perspective

- Fellows, Mike, Giannopoulos, Panos, Knauer, Christian, Paul, Christophe, Rosamond, Frances, Whitesides, Sue, Yu, Nathan

W-Hierarchies defined by symmetric gates

- Fellows, Michael, Flum, Jörg, Hermelin, Danny, Müller, Moritz, Rosamond, Frances

Distortion is fixed parameter tractable

- Fellows, Michael R., Fomin, Fedor V., Lokshtanov, Daniel, Losievskaja, Eelena, Rosamond, Frances A., Saurabh, Saket

Graph-based data clustering with overlaps

- Fellows, Michael R., Guo, Jiong, Komusiewicz, Christian, Niedermeier, Rolf, Uhlmann, Joannes

On problems without polynomial kernels

- Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny

The complexity ecology of parameters: an illustration using bounded max leaf number

- Fellows, Michael, Lokshtanov, Daniel, Misra, Neeldhara, Mnich, Matthias, Rosamond, Frances, Saurabh, Saket

What makes equitable connected partition easy

- Enciso, Rosa, Fellows, Michael R., Guo, Jiong, Kanj, Iyad, Rosamond, Frances, Ondrej, Suchy

Faster fixed-parameter tractable algorithms for matching and packing problems

- Fellows, M. R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D. M., Whitesides, S.

Graph layout problems parameterized by vertex cover

- Fellows, Michael R., Lokshtanov, Daniel, Misra, Neeldhara, Rosamond, Frances A., Saurabh, Saket

On the parameterized complexity of layered graph drawing

- Dujmovic, Vida, Fellows, Michael R., Kitching, Matthew, Liotta, Giuseppe, McCartin, Catherine, Nishimura, Naomi, Ragde, Prabhakar, Rosamond, Frances, Whitesides, Sue, Wood, David R.

Parameterized approximation of dominating set problems

- Downey, Rodney G., Fellows, Michael R., McCartin, Catherine, Rosamond, Frances

Parameterized complexity and biopolymer sequence comparison

- Cai, Liming, Huang, Xiuzhen, Liu, Chunmei, Rosamond, Frances, Song, Yinglei

The Computer Journal special issue on parameterized complexity: foreword by the guest editors (editorial)

- Downey, Rodney G., Fellows, Michael R., Langston, Michael A.

On finding short resolution refutations and small unsatisfiable subsets

- Fellows, Michael R., Szeider, Stefan, Wrightson, Graham

Parametric duality and kernelization: Lower bounds and upper bounds on kernel size

- Chen, J. N., Fernau, Henning, Kanj, I. A., Xia, G.